A Partial Correctness Proof for Programs with Decided Specifications
نویسنده
چکیده
This paper provides the method and complete proof for programs written in Pascal programming language with decided specifications for programs which reverse the digits of an integer from [5]. The author of this paper describes a new concept of partial correctness of programs better suited to specification purposes than the classical one. Partial correctness specifications are pairs of assertions, preconditions and postconditions. As an application of partial correctness specifications, the paper presents the correctness method for some of the programs which have been written in procedural programming language. Moreover, this method is suitable for all procedural programs.
منابع مشابه
Extracting Computer Algebra Programs from Statements
In this paper, an approach to synthesize correct programs from specifications is presented. The idea is to extract code from definitions appearing in statements which have been mechanically proved with the help of a proof assistant. This approach has been found when proving the correctness of certain Computer Algebra programs (for Algebraic Topology) by using the Isabelle proof assistant. To ea...
متن کاملJKelloy: A Proof Assistant for Relational Specifications of Java Programs
Alloy is a relational specification language with a built-in transitive closure operator which makes it particularly suitable for writing concise specifications of linked data structures. Several tools support Alloy specifications for Java programs. However, they can only check the validity of those specifications with respect to a bounded domain, and thus, in general, cannot provide correctnes...
متن کاملA Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification
We present a framework for simultaneously verifying the functional correctness and the worst-case asymptotic time complexity of higher-order imperative programs. We build on top of Separation Logic with Time Credits, embedded in an interactive proof assistant. We formalize the O notation, which is key to enabling modular specifications and proofs. We cover the subtleties of the multivariate cas...
متن کاملProgram Synthesis from Axiomatic Proof of Correctness
We axiomatically prove statements of the form: program PROG meets specification SPEC. We derive 7 axioms from the definition of the PHP programming language in which the programs are to be written. For each primitive function or process described, we write a program that uses only that feature (function or process), and we have an axiom that this program meets the specification described. Gener...
متن کاملRoland Backhouse : Relational Theory of Data Types 5 David Basin : Program Synthesis as Higher Order Resolution
Introduction 4 Roland Backhouse: Relational Theory of Data Types 5 David Basin: Program Synthesis as Higher Order Resolution 6 Bettina Buth: Verification Support for Compiler Development 7 Debora Weber-Wulff: Growing Programs from Proofs 8 Jacques Loeckx (with M. Wolf): Constructive versus axiomatic and initial specifications 9 Friederike Nickl: An Algebraic/Axiomatic Interpretation of Data Flo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007